Minimum-redundancy linear arrays

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Redundancy in Genotyping Arrays

Despite their unprecedented density, current SNP genotyping arrays contain large amounts of redundancy, with up to 40 oligonucleotide features used to query each SNP. By using publicly available reference genotype data from the International HapMap, we show that 93.6% sensitivity at <5% false positive rate can be obtained with only four probes per SNP, compared with 98.3% with the full data set...

متن کامل

Computational Arrays with Flexible Redundancy

AbstmctDifferent multiple redundancy schemes for fault detection and correction in computational arrays are proposed and analyzed. The basic idea is to embed a logical array of nodes onto a processor/switch array such that d processors, 1 2 d 5 4, are dedicated to the computation associated with each node. The input to a node is directed to the d processors constituting that node, and the outpu...

متن کامل

Distributing Orthogonal Redundancy on Adaptive Disk Arrays

When upgrading storage systems, the key is migrating data from old storage subsystems to the new ones for achieving a data layout able to deliver high performance I/O, increased capacity and strong data availability while preserving the effectiveness of its location method. However, achieving such data layout is not trivial when handling a redundancy scheme because the migration algorithm must ...

متن کامل

Efficient Spectral Feature Selection with Minimum Redundancy

Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and unsupervised feature selection, and has been proven to be effective in many real-world applications. One common drawback associated with most existing spectral feature selection algorithms is that they evaluate features i...

متن کامل

Fast-Ensembles of Minimum Redundancy Feature Selection

Finding relevant subspaces in very highdimensional data is a challenging task not only for microarray data. The selection of features must be stable, but on the other hand learning performance is to be increased. Ensemble methods have succeeded in the increase of stability and classification accuracy, but their runtime prevents them from scaling up to real-world applications. We propose two met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Antennas and Propagation

سال: 1968

ISSN: 0096-1973

DOI: 10.1109/tap.1968.1139138